Semi-stable extensions on arithmetic surfaces

نویسنده

  • C. Soulé
چکیده

Let S be a smooth projective curve over the complex numbers and X → S a semi-stable projective family of curves. Assume that both S and the generic fiber of X over S have genus at least two. Then the sheaf of absolute differentials ΩX defines a vector bundle on X which is semi-stable in the sense of Mumford-Nakano with respect to the canonical line bundle on X . The Bogomolov inequality c1(Ω 1 X) ≤ 4 c2(Ω 1 X) leads to an upper bound for the self-intersection c1(ωX/S) 2 of the relative dualizing sheaf ωX/S . Assume now that S is the spectrum Spec (OF ) of the ring of integers in a number field F and that X → S is a semi-stable (regular) curve over S, with generic genus at least two. In [7], Parshin asked for a similar upper bound for the arithmetic self-intersection ĉ1(ω̄X/S) 2 of the relative dualizing sheaf of X over S, equipped with its Arakelov metric. He and Moret-Bailly [5] proved that a good upper bound for this real number ĉ1(ω̄X/S) 2 would have beautiful arithmetic consequences (including the abc conjecture).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability and Arithmetic

Stability plays a central role in arithmetic. In this article, we explain some basic ideas and present certain constructions for such studies. There are two aspects: namely, general Class Field Theories for Riemann surfaces using semistable parabolic bundles & for p-adic number fields using what we call semi-stable filtered (φ,N;ω)-modules; and non-abelian zeta functions for function fields ove...

متن کامل

On the Existence of Semi-Stable Extensions

In this paper, we describe an open problem in abstract argumentation theory: the precise conditions under which semi-stable extensions exist. Although each finite argumentation framework can be shown to have at least one semi-stable extension, this is no longer the case when infinite argumentation frameworks are considered. This puts semi-stable semantics between stable and preferred semantics....

متن کامل

An Algorithm for Computing Semi-stable Semantics

The semi-stable semantics for formal argumentation has been introduced as a way of approximating stable semantics in situations where no stable extensions exist. Semi-stable semantics can be located between stable semantics and preferred semantics in the sense that every stable extension is a semi-stable extension and every semi-stable extension is a preferred extension. Moreover, in situations...

متن کامل

Height and Arithmetic Intersection for a Family of Semi-stable Curves

In this paper, we consider an arithmetic Hodge index theorem for a family of semi-stable curves, generalizing Faltings-Hriljac’s arithmetic Hodge index theorem for an arithmetic surface.

متن کامل

Fast reliable interrogation of procedurally defined implicit surfaces using extended revised affine arithmetic

Techniques based on Interval and Affine Arithmetic and their modifications are shown to provide reliable function range evaluation for the purposes of surface interrogation. In this paper we present a technique for the reliable interrogation of implicit surfaces using a modification of Affine Arithmetic called Revised Affine Arithmetic. We extend the range of functions presented in Revised Affi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005